Coupon collecting and transversals of hypergraphs
نویسندگان
چکیده
The classic Coupon-Collector Problem (CCP) is generalized. Only basic probability theory is used. Centerpiece rather is an algorithm that efficiently counts all k-element transversals of a set system.
منابع مشابه
Coupon Collecting with or without Replacement, and with Multipurpose Coupons
The classic Coupon-Collector Problem (CCP) is generalized. Only basic probability theory is used. Centerpiece rather is an algorithm that efficiently counts all k-element transversals of a set system.
متن کاملCoupons collecting with or without replacement, and with multipurpose coupons
The classic Coupon-Collector Problem (CCP) is generalized. Only basic probability theory is used. Centerpiece rather is an algorithm that efficiently counts all k-element transversals of a set system.
متن کاملFaster Algorithms to Enumerate Hypergraph Transversals
A transversal of a hypergraph is a set of vertices intersecting each hyperedge. We design and analyze new exponential-time algorithms to enumerate all inclusion-minimal transversals of a hypergraph. For each fixed k ≥ 3, our algorithms for hypergraphs of rank k, where the rank is the maximum size of a hyperedge, outperform the previous best. This also implies improved upper bounds on the maximu...
متن کاملPartitioning of Loop-free Sperner Hypergraphs into Transversals
This article explores possibilities of partitioning the vertex set of a given simple loop-free Sperner hypergraph into a union of transversals. Studies are done on the possible number of transversals in such partitions, followed by forming a hypergraph (on the vertex set of the given hypergraph) that consists of transversals for hyperedges. AMS Subject Classification: 05C65
متن کاملA New Algorithm for the Hypergraph Transversal Problem
We consider the problem of finding all minimal transversals of a hypergraph H ⊆ 2 , given by an explicit list of its hyperedges. We give a new decomposition technique for solving the problem with the following advantages: (i) Global parallelism: for certain classes of hypergraphs, e.g. hypergraphs of bounded edge size, and any given integer k, the algorithm outputs k minimal transversals of H i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 15 شماره
صفحات -
تاریخ انتشار 2013